Loose Hamilton cycles in hypergraphs
نویسندگان
چکیده
We prove that any k-uniform hypergraph on n vertices with minimum degree at least n 2(k−1) + o(n) contains a loose Hamilton cycle. The proof strategy is similar to that used by Kühn and Osthus for the 3-uniform case. Though some additional difficulties arise in the k-uniform case, our argument here is considerably simplified by applying the recent hypergraph blow-up lemma of Keevash.
منابع مشابه
Minimum vertex degree conditions for loose Hamilton cycles in 3-uniform hypergraphs
We investigate minimum vertex degree conditions for 3-uniform hypergraphs which ensure the existence of loose Hamilton cycles. A loose Hamilton cycle is a spanning cycle in which consecutive edges intersect in a single vertex. We prove that every 3-uniform n-vertex (n even) hypergraph H with minimum vertex degree δ1(H) ≥ ( 7 16 + o(1) ) ( n 2 ) contains a loose Hamilton cycle. This bound is asy...
متن کاملMinimum Vertex Degree Conditions for Loose Hamilton Cycles in 3-uniform Hypergraphs
We investigate minimum vertex degree conditions for 3-uniform hypergraphs which ensure the existence of loose Hamilton cycles. A loose Hamilton cycle is a spanning cycle in which consecutive edges intersect in a single vertex. We prove that every 3-uniform n-vertex (n even) hypergraph H with minimum vertex degree δ1(H) ≥ ( 7 16 + o(1) ) (n 2 ) contains a loose Hamilton cycle. This bound is asym...
متن کاملPerfect Matchings, Tilings and Hamilton Cycles in Hypergraphs
This thesis contains problems in finding spanning subgraphs in graphs, such as, perfect matchings, tilings and Hamilton cycles. First, we consider the tiling problems in graphs, which are natural generalizations of the matching problems. We give new proofs of the multipartite Hajnal-Szemerédi Theorem for the tripartite and quadripartite cases. Second, we consider Hamilton cycles in hypergraphs....
متن کاملThe Complexity of the Hamilton Cycle Problem in Hypergraphs of High Minimum Codegree
We consider the complexity of the Hamilton cycle decision problem when restricted to k-uniform hypergraphs H of high minimum codegree δ(H). We show that for tight Hamilton cycles this problem is NP-hard even when restricted to k-uniform hypergraphsH with δ(H) ≥ n2−C, where n is the order of H and C is a constant which depends only on k. This answers a question raised by Karpiński, Ruciński and ...
متن کاملLoose Hamilton Cycles in Random 3-Uniform Hypergraphs
In the random hypergraph H = Hn,p;3 each possible triple appears independently with probability p. A loose Hamilton cycle can be described as a sequence of edges {xi, yi, xi+1} for i = 1, 2, . . . , n/2 where x1, x2, . . . , xn/2, y1, y2, . . . , yn/2 are all distinct. We prove that there exists an absolute constant K > 0 such that if p > K logn n then lim n→∞ 4|n Pr(Hn,p;3 contains a loose Ham...
متن کاملLoose Hamilton Cycles in Random k-Uniform Hypergraphs
In the random k-uniform hypergraph Hn,p;k of order n each possible k-tuple appears independently with probability p. A loose Hamilton cycle is a cycle of order n in which every pair of adjacent edges intersects in a single vertex. We prove that if pn/ logn tends to infinity with n then lim n→∞ 2(k−1)|n Pr(Hn,p;k contains a loose Hamilton cycle) = 1.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 311 شماره
صفحات -
تاریخ انتشار 2011